全文获取类型
收费全文 | 16377篇 |
免费 | 1968篇 |
国内免费 | 1437篇 |
专业分类
电工技术 | 1041篇 |
综合类 | 2483篇 |
化学工业 | 1040篇 |
金属工艺 | 537篇 |
机械仪表 | 691篇 |
建筑科学 | 817篇 |
矿业工程 | 268篇 |
能源动力 | 180篇 |
轻工业 | 689篇 |
水利工程 | 181篇 |
石油天然气 | 343篇 |
武器工业 | 222篇 |
无线电 | 1619篇 |
一般工业技术 | 1121篇 |
冶金工业 | 885篇 |
原子能技术 | 37篇 |
自动化技术 | 7628篇 |
出版年
2024年 | 53篇 |
2023年 | 239篇 |
2022年 | 420篇 |
2021年 | 448篇 |
2020年 | 510篇 |
2019年 | 454篇 |
2018年 | 429篇 |
2017年 | 586篇 |
2016年 | 685篇 |
2015年 | 784篇 |
2014年 | 1160篇 |
2013年 | 1161篇 |
2012年 | 1291篇 |
2011年 | 1426篇 |
2010年 | 1152篇 |
2009年 | 1113篇 |
2008年 | 1153篇 |
2007年 | 1222篇 |
2006年 | 984篇 |
2005年 | 877篇 |
2004年 | 691篇 |
2003年 | 590篇 |
2002年 | 494篇 |
2001年 | 413篇 |
2000年 | 312篇 |
1999年 | 209篇 |
1998年 | 152篇 |
1997年 | 129篇 |
1996年 | 98篇 |
1995年 | 86篇 |
1994年 | 60篇 |
1993年 | 47篇 |
1992年 | 48篇 |
1991年 | 37篇 |
1990年 | 22篇 |
1989年 | 27篇 |
1988年 | 19篇 |
1987年 | 16篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1975年 | 8篇 |
1962年 | 7篇 |
1961年 | 7篇 |
1958年 | 9篇 |
1955年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
Tao Cheng Yi-Zhou Zhang Shi Wang Ya-Li Chen Si-Ya Gao Feng Wang Wen-Yong Lai Wei Huang 《Advanced functional materials》2021,31(24):2101303
Stretchable self-healing supercapacitors (SCs) can operate under extreme deformation and restore their initial properties after damage with considerably improved durability and reliability, expanding their opportunities in numerous applications, including smart wearable electronics, bioinspired devices, human–machine interactions, etc. It is challenging, however, to achieve mechanical stretchability and self-healability in energy storage technologies, wherein the key issue lies in the exploitation of ideal electrode and electrolyte materials with exceptional mechanical stretchability and self-healing ability besides conductivity. Conductive hydrogels (CHs) possess unique hierarchical porous structure, high electrical/ionic conductivity, broadly tunable physical and chemical properties through molecular design and structure regulation, holding tremendous promise for stretchable self-healing SCs. Hence, this review is innovatively constructed with a focus on stretchable and self-healing CH based electrodes and electrolytes for SCs. First, the common synthetic approaches of CHs are introduced; then the stretching and self-healing strategies involved in CHs are systematically elaborated; followed by an explanation of the conductive mechanism of CHs; then focusing on CH-based electrodes and electrolytes for stretchable self-healing SCs; subsequently, application of stretchable and self-healing SCs in wearable electronics are discussed; finally, a conclusion is drawn along with views on the challenges and future research directions regarding the field of CHs for SCs. 相似文献
32.
为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本. 相似文献
33.
构建工程咨询机构BIM技术应用能力评价的指标体系,提出改进的熵权TOPSIS评价模型,以4个典型的工程咨询单位为例,进行BIM技术运用能力评价。研究表明,BIM行业的整体水平已经有了明显的提升,但是区域间的发展还存在一定差距。 相似文献
34.
35.
The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness. 相似文献
36.
Energy-efficient scheduling is highly necessary for energy-intensive industries, such as glass, mould or chemical production. Inspired by a real-world glass-ceramics production process, this paper investigates a bi-criteria energy-efficient two-stage hybrid flow shop scheduling problem, in which parallel machines with eligibility are at stage 1 and a batch machine is at stage 2. The performance measures considered are makespan and total energy consumption. Time-of-use (TOU) electricity prices and different states of machines (working, idle and turnoff) are integrated. To tackle this problem, a mixed integer programming (MIP) is formulated, based on which an augmented ε-constraint (AUGMECON) method is adopted to obtain the exact Pareto front. A problem-tailored constructive heuristic method with local search strategy, a bi-objective tabu search algorithm and a bi-objective ant colony optimisation algorithm are developed to deal with medium- and large-scale problems. Extensive computational experiments are conducted, and a real-world case is solved. The results show effectiveness of the proposed methods, in particular the bi-objective tabu search. 相似文献
37.
Jonatas B. C. Chagas Ulisses E. F. Silveira Andr G. Santos Marcone J. F. Souza 《International Transactions in Operational Research》2020,27(1):112-137
This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based algorithm that was able to find solutions with same or higher quality in shorter computational time for most instances when compared to the methods already present in the literature. 相似文献
38.
《International Journal of Hydrogen Energy》2020,45(19):11309-11320
This paper addresses an improved optimization method to enhance the energy extraction capability of fuel cell implementations. In this study, the proposed method called Dynamic Cuckoo Search Algorithm (DCSA) is tested in a stand-alone fuel cell in order to control the system power under dynamic temperature response. In the operational process, a fuel cell is connected to a load through a dc-dc boost converter, and DCSA is utilized to adjust the switching duration in dc-dc converter by using voltage, current and temperature parameters. In this way, it controls the output voltage to maximize power delivery capability at the demand-side and eliminates the drawback of conventional cuckoo search algorithm (CSA) which cannot change duty cycle under operating temperature variations. In this regard, DCSA shows a significant improvement in terms of system response and achieves a more efficient power extraction than the conventional CSA method. In order to demonstrate the system performance, the stand-alone fuel cell system is constructed in Simulink environment via a processor-in the-loop (PIL) based digital implementation and analyzed by using different optimization methods. In the analysis section, the results of the proposed method are compared with conventional methods (perturb&observe mppt, incremental conductance mppt, and particle swarm optimization). In this context, convergence speed and efficiency analysis for both methods verify that the DCSA gives original results compared to conventional methods. 相似文献
39.
Keyword search is the most popular technique for querying large tree-structured datasets, often of unknown structure, in the web. Recent keyword search approaches return lowest common ancestors (LCAs) of the keyword matches ranked with respect to their relevance to the keyword query. A major challenge of a ranking approach is the efficiency of its algorithms as the number of keywords and the size and complexity of the data increase. To face this challenge most of the known approaches restrict their ranking to a subset of the LCAs (e.g., SLCAs, ELCAs), missing relevant results.In this work, we design novel top-k-size stack-based algorithms on tree-structured data. Our algorithms implement ranking semantics for keyword queries which is based on the concept of LCA size. Similar to metric selection in information retrieval, LCA size reflects the proximity of keyword matches in the data tree. This semantics does not rank a predefined subset of LCAs and through a layered presentation of results, it demonstrates improved effectiveness compared to previous relevant approaches. To address performance challenges our algorithms exploit a lattice of the partitions of the keyword set, which empowers a linear time performance. This result is obtained without the support of auxiliary precomputed data structures. An extensive experimental study on various and large datasets confirms the theoretical analysis. The results show that, in contrast to other approaches, our algorithms scale smoothly when the size of the dataset and the number of keywords increase. 相似文献
40.
While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular fractional factorial split-plot designs was either based only on Plackett–Burman designs, or on small nonregular designs with limited numbers of factors. In this article, we present a novel approach to designing general orthogonal fractional factorial split-plot designs. One key feature of our approach is that it can be used to construct two-level designs as well as designs involving one or more factors with more than two levels. Moreover, the approach can be used to create two-level designs that match or outperform alternative designs in the literature, and to create two-level designs that cannot be constructed using existing methodology. Our new approach involves the use of integer linear programming and mixed integer linear programming, and, for large design problems, it combines integer linear programming with variable neighborhood search. We demonstrate the usefulness of our approach by constructing two-level split-plot designs of 16–96 runs, an 81-run three-level split-plot design, and a 48-run mixed-level split-plot design. Supplementary materials for this article are available online. 相似文献